Existence of matrices with prescribed entries

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controllability of pairs of matrices with prescribed entries

Let F be an infinite field and let (A1, A2) = [ a1,1 a1,2 a2,1 a2,2 ] , [ a1,3 a2,3 ] , where the entries ai,j ∈ F , i ∈ {1, 2}, j ∈ {1, 2, 3}. In this paper we establish necessary and sufficient conditions under which it is possible to prescribe some entries of  A1 A2  , so that the pair (A1, A2) is completely controllable. © 2011 Elsevier Ltd. All rights reserved.

متن کامل

Existence of Matrices with Prescribed Off-Diagonal Block Element Sums

Necessary and sufficient conditions are proven for the existence of a square matrix, over an arbitrary field, such that for every principal submatrix the sum of the elements in the row complement of the submatrix is prescribed. The problem is solved in the cases where the positions of the nonzero elements of A are contained in a given set of positions, and where there is no restriction on the p...

متن کامل

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

Extension of matrices with Laurent polynomial entries

Let P and Q be nr, r n matrices with Laurent polynomial entries. Suppose that Q T (z)P (z) = I r , z 2 Cnf0g. This note provides an algorithmatic construction of two n(nr) matrices G and H with Laurent polynomial entries such that the nn matrices

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1986

ISSN: 0024-3795

DOI: 10.1016/0024-3795(86)90242-9